The Performance and Simulative analysis of MANET Routing Protocols with Different Mobility Models

A Mobile Ad-hoc Network (MANET) consists of a number of mobile nodes. These mobile nodes can communicate without any centralized control mechanism. MANETs are self-organizing and selfconfiguring multi node wireless networks without any infrastructure. In MANET the structure of the network changes dynamically. The fundamental characteristic of MANETs which differentiate it from other wireless or wired networks is its mobility feature. The mobile nodes can receive and relay packets as a router. Routing is an important issue for an efficient routing protocol makes the MANET reliable. The node in the wireless or wired network not only acts as hosts but also act like a routers that route data to/from other nodes in network. Each device in a MANET is free to move independently in any direction and will therefore change its links to other devices frequently. Routing in Ad-HOC networks has been a challenging task before the wireless networks came into existence. There are two types of features of MANET absence of fixed infrastructure. & absence of central control administration. MANET routing protocols are designed to adapt easily dynamic changes in topology while maximizing average throughput and packet delivery fraction, and minimizing end to end delay, network routing load and energy consumption. Important design issue for efficient and effective routing protocols for MANETs is to achieve the optimum values of performance parameters under network scenarios where nodes are subjected to different types of mobility model that dynamically change the network topology. In this we discuss about simulation & comparison of the performance between types of routing protocols, Table Driven (Proactive), On-Demand (Reactive) in different mobility models like Gauss Markov model, Manhattan Grid model and Random Walk model. The present approach shows simulation study and comparison of the performance between categories of routing protocols, table-driven (Proactive), on-demand (Reactive) routing protocol in three different mobility models. These three categories were illustrated by using four different examples of routing protocols. First example is AODV (Ad Hoc On-Demand Distance Vector) from the Proactive family, DSDV (Distance Vector Routing Protocol) from the Reactive family and DSR(Demand Source Routing) and AOMDV(Adhoc on Multipath Demand Distance Vector) .They are simulate in these three models Gauss Markov model, Manhattan Grid model and Random Walk model. Keywords— Aodv, Dsdv, Dsr, Aomdv, Mobility Model, Protocol Selection.